Isomorphisms of Some Cyclic Abelian Covers of Symmetric Digraphs
نویسنده
چکیده
$D$ if $D^{j}$ is a g-cyclic A-cover of $D$ for some $g\in A$ . In the case that $A$ is abelian, . then $D_{g}(\alpha)$ is simply called a cyclic abelian cover. Let $\alpha$ and $\beta$ be two alternating functions $homA(D)$ into $A$ , and let $\Gamma$ be a subgroup of the automorphism group Aut $D$ of $D$ , denoted $\Gamma\leq$ Aut $D$ . Let $g,$ $h\in A$ . Then two cyclic A-covers $D_{g}(\alpha)$ and $D_{h}(\beta)$ are called $\Gamma$ -isomorphic, denoted $D_{g}(\alpha)\cong\Gamma D_{h}(\beta)$ , if there exi$st$ an isomorphism $\Phi$ : $D_{g}(\alpha)\rightarrow D_{h}(\beta)$ and a $\gamma\in\Gamma$ such that $\pi\Phi=\gamma\pi$ , i.e., the diagram
منابع مشابه
Isomorphisms and automorphism groups of a class of Cayley digraphs on Abelian groups
In this paper, we investigate problems about isomorphisms and automorphism groups of Cayley digraphs. A class of Cayley digraphs, corresponding to the so-called CDI-subsets, for which the isomorphisms are uniquely determined by the group automorphisms is characterized. Their automorphism groups are also characterized.
متن کاملArc-Transitive Dihedral Regular Covers of Cubic Graphs
A regular covering projection is called dihedral or abelian if the covering transformation group is dihedral or abelian. A lot of work has been done with regard to the classification of arc-transitive abelian (or elementary abelian, or cyclic) covers of symmetric graphs. In this paper, we investigate arc-transitive dihedral regular covers of symmetric (arc-transitive) cubic graphs. In particula...
متن کاملGraph Covering and Its Generalization
We present some topics on graph covering and its generalization. We survey some results on enumeration of isomorphism classes of coverings of a graph and g-cyclic A-covers of a symmetric digraph, where $A$ is a finite group and $g\in A$ . We also mention some related questions.
متن کاملNon-Abelian Sequenceable Groups Involving ?-Covers
A non-abelian finite group is called sequenceable if for some positive integer , is -generated ( ) and there exist integers such that every element of is a term of the -step generalized Fibonacci sequence , , , . A remarkable application of this definition may be find on the study of random covers in the cryptography. The 2-step generalized sequences for the dihedral groups studi...
متن کاملArc-transitive abelian regular covers of cubic graphs
Quite a lot of attention has been paid recently to the construction of edgeor arc-transitive covers of symmetric graphs. In most cases, the approach has involved voltage graph techniques, which are excellent for finding regular covers in which the group of covering transformations is either cyclic or elementary abelian, or more generally, homocyclic, but are not so easy to use when the covering...
متن کامل